منابع مشابه
Random Intersection Graph Process
Vertices of an affiliation network are linked to features and two vertices are declared adjacent whenever they share a common feature. We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks. We establish the asymptotic degree distribution and provide explicit asymptotic formulas for assortativity and clustering coefficients showing how these edge...
متن کاملIntersection of Random Sets 3
We prove compact-randomness of the intersection of a measurable familyof compact-random sets. This generalizes results on the intersection of countable families of random sets. The main tools are given by the theory of Souslin spaces and the idea of countable separation. An example of a random set is given by the energy spectrum of an electron in a disordered solid, or more generally by the spe...
متن کاملConnectivity of the uniform random intersection graph
A uniform random intersection graph G(n,m, k) is a random graph constructed as follows. Label each of n nodes by a randomly chosen set of k distinct colours taken from some finite set of possible colours of size m. Nodes are joined by an edge if and only if some colour appears in both their labels. These graphs arise in the study of the security of wireless sensor networks, in particular when m...
متن کاملIntersection graph of gamma sets in the total graph
In this paper, we consider the intersection graph IΓ(Zn) of gamma sets in the total graph on Zn. We characterize the values of n for which IΓ(Zn) is complete, bipartite, cycle, chordal and planar. Further, we prove that IΓ(Zn) is an Eulerian, Hamiltonian and as well as a pancyclic graph. Also we obtain the value of the independent number, the clique number, the chromatic number, the connectivit...
متن کاملVertex Degree of Random Intersection Graph
A random intersection graph is constructed by independently assigning a subset of a given set of objects W, to each vertex of the vertex set V of a simple graph G. There is an edge between two vertices of V, iff their respective subsets(in W ,) have at least one common element. The strong threshold for the connectivity between any two arbitrary vertices of vertex set V, is derived. Also we dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90077-f